منابع مشابه
A new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملNew Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n colors. There are no indications that coloring using say O(log n) colors is hard. It has been suggested that lift and project based SDP relaxations could be used to design algorithms that use n colors for arbitrarily small > 0. We explore this possibility in this pape...
متن کاملa new simulated annealing algorithm for the robust coloring problem
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
متن کاملTopology coloring
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...
متن کاملA New Genetic Graph Coloring Heuristic
The aim of this paper is to introduce a new evolutionary formulation of the graph coloring problem, based on the interplay between orderings and colorings of vertices. The new formulation breaks symmetry in the solution space and provides opportunities for combining evolutionary and other search tehniques. Our formulation is very simple compared to previous approaches which use the relationship...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1880
ISSN: 0036-8733
DOI: 10.1038/scientificamerican02211880-3439asupp